Lifted Hinge-Loss Markov Random Fields

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intelligent Multitrack Reverberation Based on Hinge-Loss Markov Random Fields

We propose a machine learning approach based on hinge-loss Markov random fields to solve the problem of applying reverb automatically to a multitrack session. With the objective of obtaining perceptually meaningful results, a set of Probabilistic Soft Logic (PSL) rules has been defined based on best practices recommended by experts. These rules have been weighted according to the level of confi...

متن کامل

Hinge-Loss Markov Random Fields and Probabilistic Soft Logic

This paper introduces hinge-loss Markov random fields (HL-MRFs), a new class of probabilistic graphical models particularly well-suited to large-scale structured prediction and learning. We derive HL-MRFs by unifying and then generalizing three different approaches to scalable inference in structured models: (1) randomized algorithms for MAX SAT, (2) local consistency relaxation for Markov rand...

متن کامل

Hinge-loss Markov Random Fields: Convex Inference for Structured Prediction

Graphical models for structured domains are powerful tools, but the computational complexities of combinatorial prediction spaces can force restrictions on models, or require approximate inference in order to be tractable. Instead of working in a combinatorial space, we use hinge-loss Markov random fields (HL-MRFs), an expressive class of graphical models with log-concave density functions over...

متن کامل

Learning Latent Groups with Hinge-loss Markov Random Fields

Probabilistic models with latent variables are powerful tools that can help explain related phenomena by mediating dependencies among them. Learning in the presence of latent variables can be difficult though, because of the difficulty of marginalizing them out, or, more commonly, maximizing a lower bound on the marginal likelihood. In this work, we show how to learn hinge-loss Markov random fi...

متن کامل

Hinge-Loss Markov Random Fields and Probabilistic Soft Logic: A Scalable Approach to Structured Prediction

Title of dissertation: HINGE-LOSS MARKOV RANDOM FIELDS AND PROBABILISTIC SOFT LOGIC: A SCALABLE APPROACH TO STRUCTURED PREDICTION Stephen Hilliard Bach, Doctor of Philosophy, 2015 Dissertation directed by: Professor Lise Getoor Department of Computer Science A fundamental challenge in developing impactful artificial intelligence technologies is balancing the ability to model rich, structured do...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence

سال: 2019

ISSN: 2374-3468,2159-5399

DOI: 10.1609/aaai.v33i01.33017975